ReP USP - Resultado da busca

Artigo de periodico
Logical coherence in Bayesian simultaneous three-way hypothesis tests (2023)
Esteves, Luís Gustavo; Izbicki, Rafael ; Stern, Julio Michael ; Stern, Rafael Bassi
Source: International Journal of Approximate Reasoning. Unidade: IME
Assunto: ESTATÍSTICA APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ESTEVES, Luís Gustavo et al. Logical coherence in Bayesian simultaneous three-way hypothesis tests. International Journal of Approximate Reasoning, v. 152, p. 297-309, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2022.10.019. Acesso em: 28 abr. 2024.
APA
Esteves, L. G., Izbicki, R., Stern, J. M., & Stern, R. B. (2023). Logical coherence in Bayesian simultaneous three-way hypothesis tests. International Journal of Approximate Reasoning, 152, 297-309. doi:10.1016/j.ijar.2022.10.019
NLM
Esteves LG, Izbicki R, Stern JM, Stern RB. Logical coherence in Bayesian simultaneous three-way hypothesis tests [Internet]. International Journal of Approximate Reasoning. 2023 ; 152 297-309.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2022.10.019
Vancouver
Esteves LG, Izbicki R, Stern JM, Stern RB. Logical coherence in Bayesian simultaneous three-way hypothesis tests [Internet]. International Journal of Approximate Reasoning. 2023 ; 152 297-309.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2022.10.019
Artigo de periodico
Learning and total evidence with imprecise probabilities (2022)
Gong, Ruobin ; Kadane, Joseph B. ; Schervish, Mark J. ; Seidenfeld, Teddy ; Stern, Rafael Bassi
Source: International Journal of Approximate Reasoning. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, ENGENHARIA DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GONG, Ruobin et al. Learning and total evidence with imprecise probabilities. International Journal of Approximate Reasoning, v. 151, p. 21-32, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2022.08.016. Acesso em: 28 abr. 2024.
APA
Gong, R., Kadane, J. B., Schervish, M. J., Seidenfeld, T., & Stern, R. B. (2022). Learning and total evidence with imprecise probabilities. International Journal of Approximate Reasoning, 151, 21-32. doi:10.1016/j.ijar.2022.08.016
NLM
Gong R, Kadane JB, Schervish MJ, Seidenfeld T, Stern RB. Learning and total evidence with imprecise probabilities [Internet]. International Journal of Approximate Reasoning. 2022 ; 151 21-32.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2022.08.016
Vancouver
Gong R, Kadane JB, Schervish MJ, Seidenfeld T, Stern RB. Learning and total evidence with imprecise probabilities [Internet]. International Journal of Approximate Reasoning. 2022 ; 151 21-32.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2022.08.016
Artigo de periodico
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget (2021)
Moreira, Daniel Augusto de Melo; Delgado, Karina Valdivia ; Barros, Leliane Nunes de ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EACH, IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROCESSOS DE MARKOV, TEORIA DOS JOGOS, TEORIA DA DECISÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOREIRA, Daniel Augusto de Melo et al. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, v. 139, p. 143-165, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2021.09.003. Acesso em: 28 abr. 2024.
APA
Moreira, D. A. de M., Delgado, K. V., Barros, L. N. de, & Mauá, D. D. (2021). Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, 139, 143-165. doi:10.1016/j.ijar.2021.09.003
NLM
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Vancouver
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Artigo de periodico-carta/editorial
Special issue on robustness in probabilistic graphical models. [Editorial] (2021)
Mauá, Denis Deratani ; Campos, Cassio Polpo de
Source: International Journal of Approximate Reasoning. Unidade: IME
Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e CAMPOS, Cassio Polpo de. Special issue on robustness in probabilistic graphical models. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.ijar.2021.07.002. Acesso em: 28 abr. 2024. , 2021
APA
Mauá, D. D., & Campos, C. P. de. (2021). Special issue on robustness in probabilistic graphical models. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.ijar.2021.07.002
NLM
Mauá DD, Campos CP de. Special issue on robustness in probabilistic graphical models. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2021 ; 137 113.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.07.002
Vancouver
Mauá DD, Campos CP de. Special issue on robustness in probabilistic graphical models. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2021 ; 137 113.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.07.002
Artigo de periodico
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (2020)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: PROGRAMAÇÃO LÓGICA, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, v. 125, p. 218-239, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.004. Acesso em: 28 abr. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2020). The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, 125, 218-239. doi:10.1016/j.ijar.2020.07.004
NLM
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Vancouver
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Artigo de periodico
Complexity results for probabilistic answer set programming (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Assunto: COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, v. 118, p. 133-154, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.12.003. Acesso em: 28 abr. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2020). Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, 118, 133-154. doi:10.1016/j.ijar.2019.12.003
NLM
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Vancouver
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Artigo de periodico
Tractable inference in credal sentential decision diagrams (2020)
Mattei, Lilith; Antonucci, Alessandro; Mauá, Denis Deratani ; Facchini, Alessandro ; Villanueva Llerena, Julissa Giuliana
Source: International Journal of Approximate Reasoning. Unidade: IME
Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MATTEI, Lilith et al. Tractable inference in credal sentential decision diagrams. International Journal of Approximate Reasoning, v. 125, p. 26-48, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.06.005. Acesso em: 28 abr. 2024.
APA
Mattei, L., Antonucci, A., Mauá, D. D., Facchini, A., & Villanueva Llerena, J. G. (2020). Tractable inference in credal sentential decision diagrams. International Journal of Approximate Reasoning, 125, 26-48. doi:10.1016/j.ijar.2020.06.005
NLM
Mattei L, Antonucci A, Mauá DD, Facchini A, Villanueva Llerena JG. Tractable inference in credal sentential decision diagrams [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 26-48.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.06.005
Vancouver
Mattei L, Antonucci A, Mauá DD, Facchini A, Villanueva Llerena JG. Tractable inference in credal sentential decision diagrams [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 26-48.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.06.005
Artigo de periodico
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks (2020)
Villanueva Llerena, Julissa ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidade: IME
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VILLANUEVA LLERENA, Julissa e MAUÁ, Denis Deratani. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. International Journal of Approximate Reasoning, v. 126, p. 158-180-, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.008. Acesso em: 28 abr. 2024.
APA
Villanueva Llerena, J., & Mauá, D. D. (2020). Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. International Journal of Approximate Reasoning, 126, 158-180-. doi:10.1016/j.ijar.2020.07.008
NLM
Villanueva Llerena J, Mauá DD. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 158-180-.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.008
Vancouver
Villanueva Llerena J, Mauá DD. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 158-180-.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.008
Artigo de periodico
Thirty years of credal networks: specification, algorithms and complexity (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, v. 126, p. 133-157, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.08.009. Acesso em: 28 abr. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2020). Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, 126, 133-157. doi:10.1016/j.ijar.2020.08.009
NLM
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Vancouver
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Artigo de periodico
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws (2019)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: TEORIA DA COMPUTAÇÃO, TEORIA DOS MODELOS, AQUISIÇÃO DE CONHECIMENTO, LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, v. 110, p. 107-126, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.04.003. Acesso em: 28 abr. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2019). The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, 110, 107-126. doi:10.1016/j.ijar.2019.04.003
NLM
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Vancouver
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Artigo de periodico
Robust topological policy iteration for infinite horizon bounded Markov decision processes (2019)
Reis, Willy Arthur Silva; Barros, Leliane Nunes de ; Delgado, Karina Valdivia
Source: International Journal of Approximate Reasoning. Unidades: IME, EACH
Subjects: PROCESSOS DE MARKOV, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Willy Arthur Silva e BARROS, Leliane Nunes de e DELGADO, Karina Valdivia. Robust topological policy iteration for infinite horizon bounded Markov decision processes. International Journal of Approximate Reasoning, v. 105, p. 287-304, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.12.004. Acesso em: 28 abr. 2024.
APA
Reis, W. A. S., Barros, L. N. de, & Delgado, K. V. (2019). Robust topological policy iteration for infinite horizon bounded Markov decision processes. International Journal of Approximate Reasoning, 105, 287-304. doi:10.1016/j.ijar.2018.12.004
NLM
Reis WAS, Barros LN de, Delgado KV. Robust topological policy iteration for infinite horizon bounded Markov decision processes [Internet]. International Journal of Approximate Reasoning. 2019 ; 105 287-304.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.004
Vancouver
Reis WAS, Barros LN de, Delgado KV. Robust topological policy iteration for infinite horizon bounded Markov decision processes [Internet]. International Journal of Approximate Reasoning. 2019 ; 105 287-304.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.004
Artigo de periodico
Speeding up parameter and rule learning for acyclic probabilistic logic programs (2019)
Faria, Francisco Henrique Otte Vieira de ; Gusmão, Arthur Colombini ; De Bona, Glauber ; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: PROGRAMAÇÃO LÓGICA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FARIA, Francisco Henrique Otte Vieira de et al. Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, v. 106, p. 32-50, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.12.012. Acesso em: 28 abr. 2024.
APA
Faria, F. H. O. V. de, Gusmão, A. C., De Bona, G., Mauá, D. D., & Cozman, F. G. (2019). Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, 106, 32-50. doi:10.1016/j.ijar.2018.12.012
NLM
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Vancouver
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Artigo de periodico
Partial meet pseudo-contractions (2018)
Santos, Yuri David; Matos, Vinícius Bitencourt ; Ribeiro, Márcio Moretto; Wassermann, Renata
Source: International Journal of Approximate Reasoning. Unidades: EACH, IME
Subjects: ONTOLOGIA, LÓGICA, REVISÃO DE CRENÇAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Yuri David et al. Partial meet pseudo-contractions. International Journal of Approximate Reasoning, v. 103, p. 11-27, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.08.006. Acesso em: 28 abr. 2024.
APA
Santos, Y. D., Matos, V. B., Ribeiro, M. M., & Wassermann, R. (2018). Partial meet pseudo-contractions. International Journal of Approximate Reasoning, 103, 11-27. doi:10.1016/j.ijar.2018.08.006
NLM
Santos YD, Matos VB, Ribeiro MM, Wassermann R. Partial meet pseudo-contractions [Internet]. International Journal of Approximate Reasoning. 2018 ; 103 11-27.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.08.006
Vancouver
Santos YD, Matos VB, Ribeiro MM, Wassermann R. Partial meet pseudo-contractions [Internet]. International Journal of Approximate Reasoning. 2018 ; 103 11-27.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.08.006
Artigo de periodico
Robustifying sum-product networks (2018)
Mauá, Denis Deratani ; Conaty, Diarmaid; Cozman, Fabio Gagliardi ; Poppenhaeger, Katja; Campos, Cassio Polpo de
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: INTELIGÊNCIA ARTIFICIAL, MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani et al. Robustifying sum-product networks. International Journal of Approximate Reasoning, v. 101, p. 163-180, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.07.003. Acesso em: 28 abr. 2024.
APA
Mauá, D. D., Conaty, D., Cozman, F. G., Poppenhaeger, K., & Campos, C. P. de. (2018). Robustifying sum-product networks. International Journal of Approximate Reasoning, 101, 163-180. doi:10.1016/j.ijar.2018.07.003
NLM
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Vancouver
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Artigo de periodico
On the complexity of propositional and relational credal networks (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, TEORIA DOS GRAFOS, LÓGICA MATEMÁTICA, PROBABILIDADE, PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the complexity of propositional and relational credal networks. International Journal of Approximate Reasoning, v. 83, p. 298-319, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2016.10.008. Acesso em: 28 abr. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2017). On the complexity of propositional and relational credal networks. International Journal of Approximate Reasoning, 83, 298-319. doi:10.1016/j.ijar.2016.10.008
NLM
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 83 298-319.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
Vancouver
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 83 298-319.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
Artigo de periodico
The effect of combination functions on the complexity of relational Bayesian networks (2017)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, ANÁLISE DE ALGORITMOS, ESTATÍSTICA, ANÁLISE MULTIVARIADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, v. 85, p. 178-195, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2017.03.014. Acesso em: 28 abr. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2017). The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, 85, 178-195. doi:10.1016/j.ijar.2017.03.014
NLM
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Vancouver
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Artigo de periodico-carta/editorial
Advances in weighted logics for artificial intelligence. [Editorial] (2017)
Finger, Marcelo ; Godo, Lluis ; Prade, Henri ; Qi, Guilin
Source: International Journal of Approximate Reasoning. Unidade: IME
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo et al. Advances in weighted logics for artificial intelligence. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.ijar.2017.06.014. Acesso em: 28 abr. 2024. , 2017
APA
Finger, M., Godo, L., Prade, H., & Qi, G. (2017). Advances in weighted logics for artificial intelligence. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.ijar.2017.06.014
NLM
Finger M, Godo L, Prade H, Qi G. Advances in weighted logics for artificial intelligence. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2017 ; 88 385-386.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2017.06.014
Vancouver
Finger M, Godo L, Prade H, Qi G. Advances in weighted logics for artificial intelligence. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2017 ; 88 385-386.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2017.06.014
Artigo de periodico
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams (2016)
Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA, RACIOCÍNIO PROBABILÍSTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani. Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams. International Journal of Approximate Reasoning, v. 68, n. Ja 2016, p. 211-229, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2015.03.007. Acesso em: 28 abr. 2024.
APA
Mauá, D. D. (2016). Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams. International Journal of Approximate Reasoning, 68( Ja 2016), 211-229. doi:10.1016/j.ijar.2015.03.007
NLM
Mauá DD. Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 211-229.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2015.03.007
Vancouver
Mauá DD. Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 211-229.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2015.03.007
Artigo de periodico
Fast local search methods for solving limited memory influence diagrams (2016)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, v. 68, n. Ja 2016, p. 230-245, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2015.05.003. Acesso em: 28 abr. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2016). Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, 68( Ja 2016), 230-245. doi:10.1016/j.ijar.2015.05.003
NLM
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2015.05.003
Vancouver
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2015.05.003
Artigo de periodico
Bayesian robustness under a skew-normal class of prior distribution (2014)
Godoi, Luciana Graziela de; Branco, Marcia D'Elia
Source: International Journal of Approximate Reasoning. Unidade: IME
Subjects: ROBUSTEZ, INFERÊNCIA BAYESIANA, DISTRIBUIÇÕES (PROBABILIDADE)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GODOI, Luciana Graziela de e BRANCO, Marcia D'Elia. Bayesian robustness under a skew-normal class of prior distribution. International Journal of Approximate Reasoning, v. 55, n. 5, p. 1235-1251, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2014.03.004. Acesso em: 28 abr. 2024.
APA
Godoi, L. G. de, & Branco, M. D. 'E. (2014). Bayesian robustness under a skew-normal class of prior distribution. International Journal of Approximate Reasoning, 55( 5), 1235-1251. doi:10.1016/j.ijar.2014.03.004
NLM
Godoi LG de, Branco MD'E. Bayesian robustness under a skew-normal class of prior distribution [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( 5): 1235-1251.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2014.03.004
Vancouver
Godoi LG de, Branco MD'E. Bayesian robustness under a skew-normal class of prior distribution [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( 5): 1235-1251.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.ijar.2014.03.004

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration